Computational Strategies for the Generation of Equivalence Classes of Hadamard Matrixes

نویسنده

  • Krishnan Balasubramanian
چکیده

Hadamard matrices are useful in Hadamard transform spectroscopy and in the construction of optimal chemical designs.'-8 The use of these matrices in spectroscopy has led to the advent of Hadamard transform spectroscopy3 which employs spectroscopic multiplexing techniques and is a powerful tool for the analysis of complex spectra. Besides Hadamard matrices are useful in chemical designs and block designs. An optimal design is a method of accurately weighing a number of objects in groups rather than individually. This leads to an orthogonal set of equations that can be described by Hadamard matrices as illustrated in ref 3. The optimal weighing scheme finds applications both in chemical balance and in the multiplexing techniques pertinent to spectroscopy. These matrices also find applications in multisite Hadamard transform NMR spectroscopy.' We believe that these matrices would be potentially useful in stereochemistry. These matrices also find numerous other applications in disciplines such as computer science (errorcorrecting code), graph designs, tournaments, orthogonal arrays, projective planes, group theory, terminal networks, circuit theory, and coding theory. A n x n Hadamard matrix, H, is defined as a square matrix composed of 1's and -1's such that

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equivalence classes of n-dimensional proper Hadamard matrices

Equivalence operations for n-dimensional proper Hadamard matrices are defined. Their equivalence classes are investigated and bounds on the number of such equivalence classes are found to be associated with the number of equivalence classes of 2-dimensional Hadamard matrices. Properties of planes (2-dimensional sections) in an n-dimensional proper Hadamard matrix are investigated. It is shown t...

متن کامل

Hermite-Hadamard Type Inequalities for MφA-Convex Functions

This article deals with the different classes of convexity and generalizations. Firstly, we reveal the new generalization of the definition of convexity that can reduce many order of convexity. We have showed features of algebra for this new convex function. Then after we have constituted Hermite-Hadamard type inequalities for this class of functions. Finally the identity has been revealed for ...

متن کامل

The graph of equivalence classes and Isoclinism of groups

‎Let $G$ be a non-abelian group and let $Gamma(G)$ be the non-commuting graph of $G$‎. ‎In this paper we define an equivalence relation $sim$ on the set of $V(Gamma(G))=Gsetminus Z(G)$ by taking $xsim y$ if and only if $N(x)=N(y)$‎, ‎where $ N(x)={uin G | x textrm{ and } u textrm{ are adjacent in }Gamma(G)}$ is the open neighborhood of $x$ in $Gamma(G)$‎. ‎We introduce a new graph determined ...

متن کامل

On the classification of Hadamard matrices of order 32

All equivalence classes of Hadamard matrices of order at most 28 have been found by 1994. Order 32 is where a combinatorial explosion occurs on the number of inequivalent Hadamard matrices. We find all equivalence classes of Hadamard matrices of order 32 which are of certain types. It turns out that there are exactly 13,680,757 Hadamard matrices of one type and 26,369 such matrices of another t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Chemical Information and Computer Sciences

دوره 35  شماره 

صفحات  -

تاریخ انتشار 1995